New binary-addition tree algorithm for the all-multiterminal binary-state network reliability problem
نویسندگان
چکیده
Various real-life applications, for example, Internet of Things, wireless sensor networks, smart grids, transportation communication social and computer grid systems, are usually modeled as network structures. The binary-state composed (e.g., functioning or failed) components (arcs and/or nodes) is one the most popular two-terminal reliability a success probability that still can be calculated by verifying connectivity between two specific nodes an effective technique evaluating performance all types networks. To obtain complete information making better decisions, multi-terminal extends to node subset in which connected. In this study, new algorithm called all-multiterminal BAT proposed revising binary-addition-tree (BAT) layered-search (LSA) calculate reliabilities. efficiency effectiveness analyzed from perspective time complexity explained via numerical experiments solve problems.
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولMonte-Carlo algorithms for the planar multiterminal network reliability problem
This paper presents a general framework for the construction of Monte-Carlo algorithms for the solution of enumeration problems. As an application of the general framework, a Monte-Carlo method is constructed for estimating the failure probability of a multiterminal planar network whose edges are subject to independent random failures. The method is guaranteed to be effective when the failure p...
متن کاملA Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Reliability Engineering & System Safety
سال: 2022
ISSN: ['1879-0836', '0951-8320']
DOI: https://doi.org/10.1016/j.ress.2022.108557